Symmetric Vertex Models on Planar Random Graphs

نویسنده

  • D. A. Johnston
چکیده

We discuss a 4-vertex model on an ensemble of 3-valent (Φ) planar random graphs, which has the effect of coupling the vertex model to 2D quantum gravity. The regular lattice equivalent of the model is the symmetric 8-vertex model on the honeycomb lattice, which can be mapped on to an Ising model in field, as was originally shown by Wu et.al. using generalised weak graph transformation techniques. We note that the Ising equivalence still holds for the 4-vertex model on Φ graphs, and indeed for higher valency symmetric vertex models, which again allows a determination of the critical behaviour of the vertex model. The relations between the vertex weights and Ising model parameters are unrenormalized by the coupling to gravity, as is the equation of the Ising locus for the vertex weights. The generalised weak graph symmetry of the vertex weights which is fundamental to the solution can be understood in the Φ case as a change of integration variable in the matrix integral used to define the model. We note the Ising equivalence can be used to determine the critical behaviour of the spin one Blume-Emery-Griffiths model for a particular subset of couplings on Φ graphs, as on the honeycomb lattice, giving a rare exact solution for a higher spin model.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Potts/Ising Correspondence on Thin Graphs

We note that it is possible to construct a bond vertex model that displays q-state Potts criticality on an ensemble of φ random graphs of arbitrary topology, which we denote as “thin” random graphs in contrast to the fat graphs of the planar diagram expansion. Since the four vertex model in question also serves to describe the critical behaviour of the Ising model in field, the formulation reve...

متن کامل

Vertex Models on Feynman Diagrams

The statistical mechanics of spin models, such as the Ising or Potts models, on generic random graphs can be formulated economically by considering the N → 1 limit of N ×N Hermitian matrix models. In this paper we consider the N → 1 limit in complex matrix models, which describes vertex models of different sorts living on random graphs. From the graph theoretic perspective one is using matrix m...

متن کامل

Algorithmic tools for simulations of vertex models on random graphs* t

We consider the coupling of ice-type vertex models to random, planar ¢4 quantum-gravity graphs. The wellestablished techniques for the simulation of dynamical triangulations and their dual ¢3 graphs are suitably adapted to the case of four-valent graphs. These methods are combined with a formulation of the loop algorithm for the simulation of the vertex model matter part. We present a prelimina...

متن کامل

On the Maximum Degree of a Random Planar Graph

Let the random graph Rn be drawn uniformly at random from the set of all simple planar graphs on n labelled vertices. We see that with high probability the maximum degree of Rn is Θ(lnn). We consider also the maximum size of a face and the maximum increase in the number of components on deleting a vertex. These results extend to graphs embeddable on any fixed surface.

متن کامل

Random graphs on surfaces

Counting labelled planar graphs, and typical properties of random labelled planar graphs, have received much attention recently. We start the process here of extending these investigations to graphs embeddable on any fixed surface S. In particular we show that the labelled graphs embeddable on S have the same growth constant as for planar graphs, and the same holds for unlabelled graphs. Also, ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008